Towards explicit rewrite rules in the λΠ-calculus modulo
نویسنده
چکیده
This paper provides a new presentation of the λΠ-calculus modulo where the addition of rewrite rules is made explicit. The λΠ-calculus modulo is a variant of the λ-calculus with dependent types where β-reduction is extended with user-defined rewrite rules. Its expressiveness makes it suitable to serve as an output language for theorem provers, certified development tools or proof assistants. Addition of rewrite rules becomes an iterative process and rules previously added can be used to type new rules. We also discuss the condition rewrite rules must satisfy in order to preserve the Subject Reduction property and we give a criterion weaker than the usual one. Finally we describe the new version of Dedukti, a type-checker for the λΠ-calculus modulo for which we assess its efficiency in comparison with Coq, Twelf and Maude.
منابع مشابه
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...
متن کاملThe Subject Reduction Property in the λΠ-calculus modulo
In type theory, the subject reduction (or type preservation) property states that the type of a λ-term is preserved under reduction. This article studies this property in the context of the λΠ-calculus modulo, a variant of the λ-calculus with dependent types (λΠ-calculus) where β-reduction is extended with user-defined object-level and type-level rewrite rules. We show that it is equivalent to ...
متن کاملConservativity of Embeddings in the λΠ Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملConservativity of Embeddings in the lambda Pi Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملThe λΠ-calculus Modulo as a Universal Proof Language
The λΠ-calculus forms one of the vertices in Barendregt’s λ-cube and has been used as the core language for a number of logical frameworks. Following earlier extensions of natural deduction [14], Cousineau and Dowek [11] generalize the definitional equality of this well studied calculus to an arbitrary congruence generated by rewrite rules, which allows for more faithful encodings of foreign lo...
متن کامل